Comparison of advanced large-scale minimization algorithms on solution of inverse problems

نویسنده

  • A. K. Alekseev
چکیده

We compare the performance of several robust large-scale minimization algorithms applied for the minimization of the cost functional in the solution of inverse problems related to parameter estimation applied to the parabolized Navier-Stokes equations. The methods compared consist of Quasi-Newton (BFGS), a limited memory Quasi-Newton (L-BFGS) [1], Hessian Free Newton method [2] and a new hybrid algorithm proposed by Morales and Nocedal [3]. Introduction The following specific issues characterize the inverse CFD problems posed in the variational statement: • High CPU time required for the single cost functional computation • The computation of the gradient usually is performed using the adjoint model, which requires the same computational effort as the direct model. • The instability (due to Ill-posedness) prohibits using Newton type algorithms without explicit regularization due to the Hessian being indefinite. The conjugate gradient method is widely used for inverse problems [6] because it provides regularization implicitly by neglecting non-dominant Hessian eigenvectors. The large CPU time required for the single cost functional computation justifies the high importance attached to the choice of most efficient optimization methods. From this perspective we will compare conjugate gradient method along with several quasi-Newton and truncated Newton large-scale unconstrained minimization methods for identification of entrance boundary parameters from measurements taken in a downstream flow-field sections. Test problem We consider the identification of unknown parameters (f∞(Y)=(ρ(Y), U (Y), V (Y),T (Y))) on the entrance boundary (Fig. 1) from measurements in a flow-field section ) , ( exp m m Y X f as the test for the inverse computational fluid dynamics (CFD) problem. The algorithm consists of the flow-field calculation (direct model), the discrepancy gradient computation using both forward and adjoint models and an optimization method. The problem has all the features of ill-posed Inverse CFD problems but can be solved relatively fast when using the approximation of parabolized Navier-Stokes equations. Direct Problem The two-dimensional parabolized Navier-Stokes equations are used here in a form similar to that carried out in Refs. [5,6]. The flow (Fig. 1) is laminar and supersonic along the X coordinate. These equations describe an under-expanded jet in the supersonic flow. 0 ) ( ) ( = + Y V X U ∂ ρ ∂ ∂ ρ ∂

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparison of advanced large-scale minimization algorithms for the solution of inverse ill-posed problems

We compare the performance of several robust large-scale minimization algorithms for the unconstrained minimization of an ill-posed inverse problem. The parabolized Navier-Stokes equations model was used for adjoint parameter estimation. The methods compared consist of two versions of the nonlinear conjugate gradient method (CG), Quasi-Newton (BFGS), the limited memory Quasi-Newton (L-BFGS) [15...

متن کامل

Comparison of advanced large-scale minimization algorithms for the solution of inverse problems

We compare the performance of several robust large-scale minimization algorithms applied for the minimization of the cost functional in the solution of ill-posed inverse problems related to parameter estimation applied to the parabolized Navier-Stokes equations. The methods compared consist of the conjugate gradient method (CG), Quasi-Newton (BFGS), the limited memory Quasi-Newton (L-BFGS) [1],...

متن کامل

A heuristic approach for multi-stage sequence-dependent group scheduling problems

We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...

متن کامل

Comparison of advanced large-scale minimization algorithms for the solution of inverse ill-posed problems

We compare the performance of several robust large-scale minimization algorithms for the unconstrained minimization of an ill-posed inverse problem. The parabolized Navier–Stokes equation model was used for adjoint parameter estimation. The methods compared consist of three versions of nonlinear conjugate-gradient (CG) method, quasiNewton Broyden–Fletcher–Goldfarb–Shanno (BFGS), the limited-mem...

متن کامل

Piecewise Differentiable Minimization for Ill-posed Inverse Problems Ing from the National Science Foundation and Ibm Corporation, with Additional Support from New York State and Members of Its Corporate Research Institute. 1

Based on minimizing a piecewise diierentiable lp function subject to a single inequality constraint, this paper discusses algorithms for a discretized regularization problem for ill-posed inverse problems. We examine computational challenges of solving this regularization problem. Possible minimization algorithms such as the steepest descent method, iteratively weighted least squares (IRLS) met...

متن کامل

CONSTRAINED BIG BANG-BIG CRUNCH ALGORITHM FOR OPTIMAL SOLUTION OF LARGE SCALE RESERVOIR OPERATION PROBLEM

A constrained version of the Big Bang-Big Crunch algorithm for the efficient solution of the optimal reservoir operation problems is proposed in this paper. Big Bang-Big Crunch (BB-BC) algorithm is a new meta-heuristic population-based algorithm that relies on one of the theories of the evolution of universe namely, the Big Bang and Big Crunch theory. An improved formulation of the algorithm na...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002